MDPtoolbox: a multi-platform toolbox to solve stochastic dynamic programming problems
نویسندگان
چکیده
منابع مشابه
A New Approach to Solve Multiple Objective Programming Problems
Multiple Objective Programming (MOP) problems have become famous among many researchers due to more practical and realistic implementations. There have been a lot of methods proposed especially during the past four decades. In this paper, we develop a new algorithm based on a new approach to solve MOP problems by starting from a utopian point (which is usually infeasible) and moving towards the...
متن کاملUsing Polynomial Approximations to Solve Stochastic Dynamic Programming Problems: or A “Betty Crocker” Approach to SDP
In this paper we put forward an easy-to-implement methodology for solving deterministic or stochastic dynamic programming problems within a standard optimization package such as GAMS. We’ve found the use of orthogonal polynomials to be especially helpful in implementing approximation methods for iterative computation of the infinite-horizon value function, due to their superior convergence prop...
متن کاملA dynamic programming model to solve optimisation problems using GPUs
This thesis presents a parallel, dynamic programming based model which is deployed on the GPU of a system to accelerate the solving of optimisation problems. This is achieved by simultaneously running GPU based computations, and memory transactions, allowing computation to never pause, and overcoming the memory constraints of solving large problem instances. Due to this some optimisation proble...
متن کاملDynamic Slope Scaling Procedure to solve Stochastic Integer Programming Problem
Stochastic programming deals with optimization under uncertainty. A stochastic programming problem with recourse is referred to as a two-stage stochastic problem. We consider the stochastic programming problem with simple integer recourse in which the value of the recourse variable is restricted to a multiple of a nonnegative integer. The algorithm of a dynamic slope scaling procedure to solve ...
متن کاملMerging AI and OR to Solve High-Dimensional Stochastic Optimization Problems Using Approximate Dynamic Programming
W consider the problem of optimizing over time hundreds or thousands of discrete entities that may be characterized by relatively complex attributes, in the presence of different forms of uncertainty. Such problems arise in a range of operational settings such as transportation and logistics, where the entities may be aircraft, locomotives, containers, or people. These problems can be formulate...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Ecography
سال: 2014
ISSN: 0906-7590
DOI: 10.1111/ecog.00888